A Temporal Planning System for Time-Optimal Planning
نویسندگان
چکیده
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular way, introducing temporality on actions unbalance this symmetry. This paper presents TPSYS, a Temporal Planning SYStem, which arises as an attempt to combine the ideas of Graphplan and TGP to solve temporal planning problems more efficiently. TPSYS is based on a three-stage process. The first stage, a preprocessing stage, facilitates the management of constraints on duration of actions. The second stage expands a temporal graph and obtains the set of temporal levels at which propositions and actions appear. The third stage, the plan extraction, obtains the plan of minimal duration by finding a flow of actions through the temporal graph. The experiments show the utility of our system for dealing with temporal planning problems.
منابع مشابه
A MULTISTAGE EXPANSION PLANNING METHOD FOR OPTIMAL SUBSTATION PLACEMENT
Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. In this paper optimal substation placement problem is solved using Imperialist Competitive Algorithm (ICA) as a new developed heuristic optimization algorithm. This procedure gives the optimal size, site and installation time of medium voltage substation, using their relate...
متن کاملPlanning and Control of Two-Link Rigid Flexible Manipulators in Dynamic Object Manipulation Missions
This research focuses on proposing an optimal trajectory planning and control method of two link rigid-flexible manipulators (TLRFM) for Dynamic Object Manipulation (DOM) missions. For the first time, achievement of DOM task using a rotating one flexible link robot was taken into account in [20]. The authors do not aim to contribute on either trajectory tracking or vibration control of the End-...
متن کاملOptimal temporal planning using the plangraph framework
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and techniques have been studied and improved to deal with more complex and difficult planning domains. One such innovation was Graphplan, first developed by Blum and Furst in 1995 and soon became one of the best approaches for optimal classical planning systems. Planning systems that use Graphplan’s...
متن کاملA Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کاملTransmission expansion planning based on merchandizing surplus of transmission lines
This paper proposes an optimal transmission expansion planning (TEP) which is based on determining share of each line in merchandizing surplus (MS) of system, determining by Independent System Operator (ISO). The more share of a line in MS of system denotes the priority of a line for expansion. The procedure of determining MS of each line in a power system is based on determining the MS share o...
متن کاملOptimal pricing and replenishment policies for instantaneous deteriorating items with backlogging and trade credit under inflation
In this paper we develop an economic order quantity model to investigate the optimal replenishment policies for instantaneous deteriorating items under inflation and trade credit. Demand rate is a linear function of selling price and decreases negative exponentially with time over a finite planning horizon. Shortages are allowed and partially backlogged. Under these conditions, we model the ret...
متن کامل